Virtual Backbone of Connected Dominating Set in Wireless Ad Hoc Networks

ثبت نشده
چکیده

Wireless ad hoc networks can be flexibly and quickly deployed for many applications such as automated battlefield, search and rescue, and disaster relief. Unlike wired networks or cellular networks, no physical backbone infrastructure is installed in wireless ad hoc networks. A communication session is achieved either through a single-hop radio transmission if the communication parties are close enough, or through relaying by intermediate nodes otherwise. In this chapter, we assume that all nodes in a wireless ad hoc network are distributed in a two-dimensional plane and have an equal maximum transmission range of one unit. The topology of such wireless ad hoc network can be modeled as a unit-disk graph [6], a geometric graph in which there is an edge between two nodes if and only if their distance is at most one .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Scope of Backbone Formation in Wireless Ad Hoc Networks ¬リニ

Message efficiency is a prime concern in wireless computing because the nodes are resource constrained, failure prone, and sometimes mobile too. Over the years, the backbone construction has emerged as a powerful approach to achieve message efficiency and handle mobility in ad hoc wireless networks. In the existing literature, most popular techniques for virtual backbone formation are connected...

متن کامل

Solving Connected Dominating Set Problem in Unit Disk Graphs by Genetic Algorithms

In this paper, we use Genetic Algorithms to find the Minimum Connected Dominating Set (MCDS) of Unit Disk Graphs (UDG). UDGs are used for modeling ad-hoc networks and finding MCDS in such graphs is a promising approach to construct an efficient virtual backbone in wireless ad-hoc networks. The MCDS problem is proved to be NP-complete. The simulation results show that the proposed algorithm outp...

متن کامل

An enhanced approach to determine connected dominating sets for routing in mobile ad hoc networks

A mobile ad hoc network is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralised administration. Mobile ad hoc networks face a lot of challenges for designing a scalable routing protocol due to their natural characteristics. The IDea of virtual backbone routing has been proposed for efficient routing in mobile ad h...

متن کامل

Construction of Virtual Backbone on Growth-Bounded Graph with Variable Transmission Range

Virtual backbone has been used extensively in various aspects for wireless ad hoc or sensor networks recently. We propose an approximation solution to construct a virtual backbone based on a more generalized and realistic model of polynomial bounded growth. A localized distributed algorithm of MCDS_GBG for computing a Minimum Connected Dominating Sets as backbone in the growth-bounded graph is ...

متن کامل

Virtual backbone construction in multihop ad hoc wireless networks

Recent research points out that the flooding mechanism for topology update or route request in existing ad hoc routing protocols greatly degrades the network capacity. If we restrict the broadcast of control packets within a small subset of hosts in the network, the protocol overhead can be substantially reduced. This motivates our research of constructing a virtual backbone by computing a conn...

متن کامل

Connected Domination in Multihop Ad Hoc Wireless Networks

The idea of virtual backbone routing for ad hoc wireless networks is to operate routing protocols over a virtual backbone. One purpose of virtual backbone routing is to alleviate the serious broadcast storm problem suffered by many exiting on-demand routing protocols for route detection. Thus constructing a virtual backbone is very important. In our study, the virtual backbone is approximated b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003